Tuples, Projections and Cartesian Products
نویسنده
چکیده
The purpose of this article is to define projections of ordered pairs, and to introduce triples and quadruples, and their projections. The theorems in this paper may be roughly divided into two groups: theorems describing basic properties of introduced concepts and theorems related to the regularity, analogous to those proved for ordered pairs by Cz. Byliński [1]. Cartesian products of subsets are redefined as subsets of Cartesian products.
منابع مشابه
N-tuples and Cartesian Products for N = 5
This article deenes ordered n-tuples, projections and Cartesian products for n = 5. We prove many theorems concerning the basic properties of the n-tuples and Cartesian products that may be utilized in several further, more challenging applications. A few of these theorems are a strightforward consequence of the regularity axiom. The article originated as an upgrade of the article 3]. The artic...
متن کاملCuts in Cartesian Products of Graphs
The k-fold Cartesian product of a graph G is defined as a graph on tuples (x1, . . . , xk) where two tuples are connected if they form an edge in one of the positions and are equal in the rest. Starting with G as a single edge gives G as a k-dimensional hypercube. We study the distributions of edges crossed by a cut in G across the copies of G in different positions. This is a generalization of...
متن کاملMeasurements of interdependence in fractional Cartesian products
The notion of a fractional Cartesian product and a subsequent notion of combinatorial dimension appeared first in a harmonic-analytic context in the course of filling ”analytic” gaps between successive (ordinary) Cartesian products of spectral sets [1, 2]. (Detailed accounts of this, and much more, appear in [4].) Combinatorial dimension is an index of interdependence: attached to a subset of a...
متن کاملRelations between MDDs and Tuples and Dynamic Modifications of MDDs based constraints
We study the relations between Multi-valued Decision Diagrams (MDD) and tuples (i.e. elements of the Cartesian Product of variables). First, we improve the existing methods for transforming a set of tuples, Global Cut Seeds, sequences of tuples into MDDs. Then, we present some in-place algorithms for adding and deleting tuples from an MDD. Next, we consider an MDD constraint which is modified d...
متن کاملOptimizing STR Algorithms with Tuple Compression
Table constraints define an arbitrary constraint explicitly as a set of solutions (tuples) or non-solutions. Thus, space is proportional to number of tuples. Simple Tabular Reduction (STR), which dynamically reduces the table size by maintaining a table of only the valid tuples, has been shown to be efficient for enforcing Generalized Arc Consistency. The Cartesian product representation is ano...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989